Models for Concurrency (A revised version of DAIMI PB-429)

This is, we believe, the final version of a chaper for the Handbook of Logic and the Foundations of Computer Science, vol.IV, Oxford University Press. It surveys a range of models for parallel computertation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in this context), and models like Petri nets, asynchronous transition systems, event structures, promsets and Mazurkiewicz traces where concurrency is represented more explicitly by a form of causal independence. The presentation is unifies by casting the models in an categorytheoretic framework. One aim is to use category theory to provide abstract characterisations of constructions like parallel composition valid throughout a range of different models and use adjunctions to provide formal means for translating between different models. A knowledge of basic category theory is assumed, up to an acquaintance with the notion of adjunction.